Accessibility percolation on n-trees
نویسندگان
چکیده
–Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in ascending order. For the case when the random variables are independent and identically distributed, we derive an asymptotically exact expression for the probability that there is at least one accessible path from the root to the leaves in an n-tree. This probability tends to 1 (0) if the branching number is increased with the height of the tree faster (slower) than linearly. When the random variables are biased such that the mean value increases linearly with the distance from the root of the tree, a percolation threshold emerges at a finite value of the bias. Introduction and outline. – Percolation theory in its modern form was introduced by Broadbent and Ham-mersley in 1957 [1]. Since then percolation has become a cornerstone of probability theory and statistical physics, with applications ranging from molecular dynamics to star formation [2, 3], and new variants of the problem continue to attract much attention (e.g., [4–7]). Standard perco-lation theory is concerned with the loss of global connec-tivity in a graph when vertices or bonds are randomly removed , as quantified by the probability for the existence of an infinite cluster of contiguous vertices. Here we consider a novel kind of percolation problem inspired by evolutionary biology. Imagine a population of some lifeform endowed with the same genetic type (genotype). If a mutation occurs, a new genotype is created which can die out or replace the old one. Provided natural selection is sufficiently strong, the latter only happens if the new genotype has larger fitness. As a consequence, on longer timescales the genotype of the population takes a path through the space of genotypes along which the fitness is monotonically increasing [8]. Such a path is called selectively accessible [9, 10]. Since the relationship between genotype and fitness is very complicated and largely unknown, it is natural to assign fitness values to genotypes in a random way. Evolutionary accessibility thus becomes a statistical property of random fitness landscapes [11–13]. In recent years it has become possible to experimentally determine fitness land
منابع مشابه
Accessibility percolation and first-passage site percolation on the unoriented binary hypercube
Inspired by biological evolution, we consider the following socalled accessibility percolation problem: The vertices of the unoriented ndimensional binary hypercube are assigned independent U(0, 1) weights, referred to as fitnesses. A path is considered accessible if fitnesses are strictly increasing along it. We prove that the probability that the global fitness maximum is accessible from the ...
متن کاملOn the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
We consider a Bernoulli bond percolation on a random recursive tree of size n ≫ 1, with supercritical parameter pn = 1 − c/ lnn for some c > 0 fixed. It is known that with high probability, there exists then a unique giant cluster of size Gn ∼ e−c, and it follows from a recent result of Schweinsberg [22] that Gn has non-gaussian fluctuations. We provide an explanation of this by analyzing the e...
متن کاملPercolation and Minimal Spanning Trees
Consider a random set V n of points in the box n; n) d , generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyse the empirical distribution function F n of the lengths of edges in a minimal (Euclidean) spanning tree T n on V n. We express the limit of F n , as n ! 1, in terms of the free energies of a family of percolation processes der...
متن کاملPercolation-like Scaling Exponents for Minimal Paths and Trees in the Stochastic Mean Field Model
In the mean field (or random link) model there are n points and inter-point distances are independent random variables. For 0 < l < ∞ and in the n → ∞ limit, let δ(l) = 1/n× (maximum number of steps in a path whose average step-length is ≤ l). The function δ(l) is analogous to the percolation function in percolation theory: there is a critical value l∗ = e −1 at which δ(·) becomes non-zero, and...
متن کاملSizes of the largest clusters for supercritical percolation on random recursive trees
We consider Bernoulli bond-percolation on a random recursive tree of size n ≫ 1, with supercritical parameter p(n) = 1− t/ ln n+ o(1/ ln n) for some t > 0 fixed. We show that with high probability, the largest cluster has size close to e−tn whereas the next largest clusters have size of order n/ lnn only and are distributed according to some Poisson random measure.
متن کامل